منابع مشابه
Union nd with deletions
In the classical union nd problem we maintain a partition of a universe of n elements into disjoint sets subject to the operations union and nd The operation union A B C replaces sets A and B in the partition by their union given the name C The operation find x returns the name of the set containing the element x In this paper we revisit the union nd problem in a context where the underlying pa...
متن کاملUnion-Find volume segmentation
We present an efficient method to segment large 3d images that takes the whole 3-dimensional structure into account. We use a Union-Find data structure to record and maintain the necessary informations during the segmentation process. This structure leads to a volume labelling and facilitates interactive process by linking directly voxels to the volume they belong to. Moreover the global integr...
متن کاملRuntime Monitoring with Union-Find Structures
This paper is concerned with runtime verification of objectoriented software system. We propose a novel algorithm for monitoring the individual behaviour and interaction of an unbounded number of runtime objects. This allows for evaluating complex correctness properties that take runtime data in terms of object identities into account. In particular, the underlying formal model can express hier...
متن کاملLinear Expected Time of a Simple Union-Find Algorithm
This paper presents an analysis of a simple tree-structured disjoint set Union-Find algorithm, and shows that this algorithm requires between n and 2n steps on the average to execute a sequence of n Union and Find instructions, assuming that each pair of existing classes is equally likely to be merged by a Union instruction. Union-Find algorithms are useful in the solution to a number of proble...
متن کاملUnion - Find and Amortized Analysis
For a weighted graph G = (V,E) where we denotes the weight of edge e ∈ E, recall Kruskal’s algorithm for computing a minimum spanning tree (MST) of G (if you are having trouble remembering the MST problem or Kruskal’s algorithm, you should go back and review the notes for Lecture 13). At a high level, we begin Kruskal’s algorithm by initializing each vertex to be in its own component and the se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2014
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2636922